// 2025/10/27
// 寻找峰值

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int left = 0, right = nums.size() - 1;
        while(left < right)
        {
            int mid = (left + right) >> 1;
            if(nums[mid] < nums[mid + 1])
            {
                left = mid + 1;
            }
            else if(nums[mid] > nums[mid + 1])
            {
                right = mid;
            }
            else
            {
                return mid;
            }
        }
        return left;
    }
};